TSTP Solution File: SET169^5 by Leo-III---1.7.10

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Leo-III---1.7.10
% Problem  : SET169^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_Leo-III %s %d

% Computer : n020.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue May  7 08:06:54 EDT 2024

% Result   : Theorem 2.83s 1.64s
% Output   : Refutation 3.04s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   16 (   9 unt;   5 typ;   0 def)
%            Number of atoms       :   47 (   7 equ;   0 cnn)
%            Maximal formula atoms :    7 (   4 avg)
%            Number of connectives :  106 (   6   ~;  19   |;  24   &;  57   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :   12 (  12   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    7 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   19 (  10   ^   9   !;   0   ?;  19   :)

% Comments : 
%------------------------------------------------------------------------------
thf(a_type,type,
    a: $tType ).

thf(sk1_type,type,
    sk1: a > $o ).

thf(sk2_type,type,
    sk2: a > $o ).

thf(sk3_type,type,
    sk3: a > $o ).

thf(sk4_type,type,
    sk4: a ).

thf(1,conjecture,
    ! [A: a > $o,B: a > $o,C: a > $o] :
      ( ( ^ [D: a] :
            ( ( A @ D )
            & ( ( B @ D )
              | ( C @ D ) ) ) )
      = ( ^ [D: a] :
            ( ( ( A @ D )
              & ( B @ D ) )
            | ( ( A @ D )
              & ( C @ D ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cBOOL_PROP_70_pme) ).

thf(2,negated_conjecture,
    ~ ! [A: a > $o,B: a > $o,C: a > $o] :
        ( ( ^ [D: a] :
              ( ( A @ D )
              & ( ( B @ D )
                | ( C @ D ) ) ) )
        = ( ^ [D: a] :
              ( ( ( A @ D )
                & ( B @ D ) )
              | ( ( A @ D )
                & ( C @ D ) ) ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ~ ! [A: a > $o,B: a > $o,C: a > $o] :
        ( ( ^ [D: a] :
              ( ( A @ D )
              & ( ( B @ D )
                | ( C @ D ) ) ) )
        = ( ^ [D: a] :
              ( ( ( A @ D )
                & ( B @ D ) )
              | ( ( A @ D )
                & ( C @ D ) ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(4,plain,
    ( ( ^ [A: a] :
          ( ( sk1 @ A )
          & ( ( sk2 @ A )
            | ( sk3 @ A ) ) ) )
   != ( ^ [A: a] :
          ( ( ( sk1 @ A )
            & ( sk2 @ A ) )
          | ( ( sk1 @ A )
            & ( sk3 @ A ) ) ) ) ),
    inference(cnf,[status(esa)],[3]) ).

thf(5,plain,
    ( ( ^ [A: a] :
          ( ( sk1 @ A )
          & ( ( sk2 @ A )
            | ( sk3 @ A ) ) ) )
   != ( ^ [A: a] :
          ( ( ( sk1 @ A )
            & ( sk2 @ A ) )
          | ( ( sk1 @ A )
            & ( sk3 @ A ) ) ) ) ),
    inference(lifteq,[status(thm)],[4]) ).

thf(6,plain,
    ( ( ( sk1 @ sk4 )
      & ( ( sk2 @ sk4 )
        | ( sk3 @ sk4 ) ) )
   != ( ( ( sk1 @ sk4 )
        & ( sk2 @ sk4 ) )
      | ( ( sk1 @ sk4 )
        & ( sk3 @ sk4 ) ) ) ),
    inference(func_ext,[status(esa)],[5]) ).

thf(8,plain,
    ( ( ( sk1 @ sk4 )
      & ( ( sk2 @ sk4 )
        | ( sk3 @ sk4 ) ) )
    | ( ( sk1 @ sk4 )
      & ( sk2 @ sk4 ) )
    | ( ( sk1 @ sk4 )
      & ( sk3 @ sk4 ) ) ),
    inference(bool_ext,[status(thm)],[6]) ).

thf(19,plain,
    ( ( sk1 @ sk4 )
    | ( sk1 @ sk4 )
    | ( sk1 @ sk4 ) ),
    inference(cnf,[status(esa)],[8]) ).

thf(28,plain,
    sk1 @ sk4,
    inference(simp,[status(thm)],[19]) ).

thf(30,plain,
    ( ( $true
      & ( ( sk2 @ sk4 )
        | ( sk3 @ sk4 ) ) )
   != ( ( $true
        & ( sk2 @ sk4 ) )
      | ( $true
        & ( sk3 @ sk4 ) ) ) ),
    inference(rewrite,[status(thm)],[6,28]) ).

thf(31,plain,
    $false,
    inference(simp,[status(thm)],[30]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : SET169^5 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.16  % Command  : run_Leo-III %s %d
% 0.16/0.37  % Computer : n020.cluster.edu
% 0.16/0.37  % Model    : x86_64 x86_64
% 0.16/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37  % Memory   : 8042.1875MB
% 0.16/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37  % CPULimit : 300
% 0.16/0.37  % WCLimit  : 300
% 0.16/0.37  % DateTime : Mon May  6 13:16:24 EDT 2024
% 0.16/0.37  % CPUTime  : 
% 0.98/0.86  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.18/0.97  % [INFO] 	 Parsing done (110ms). 
% 1.18/0.98  % [INFO] 	 Running in sequential loop mode. 
% 1.69/1.19  % [INFO] 	 eprover registered as external prover. 
% 1.69/1.19  % [INFO] 	 cvc4 registered as external prover. 
% 1.69/1.20  % [INFO] 	 Scanning for conjecture ... 
% 1.84/1.24  % [INFO] 	 Found a conjecture and 0 axioms. Running axiom selection ... 
% 1.84/1.26  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 1.84/1.27  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 1.84/1.27  % [INFO] 	 Type checking passed. 
% 1.84/1.27  % [CONFIG] 	 Using configuration: timeout(300) with strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>.  Searching for refutation ... 
% 2.83/1.63  % [INFO] 	 Killing All external provers ... 
% 2.83/1.64  % Time passed: 1104ms (effective reasoning time: 655ms)
% 2.83/1.64  % Solved by strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>
% 2.83/1.64  % Axioms used in derivation (0): 
% 2.83/1.64  % No. of inferences in proof: 11
% 2.83/1.64  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1104 ms resp. 655 ms w/o parsing
% 3.04/1.72  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.04/1.72  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------